Fast Arithmetic on ATmega128 for Elliptic Curve Cryptography
نویسندگان
چکیده
Authentication protocols are indispensable in wireless sensor networks. Commonly they are based on asymmetric cryptographic algorithms. In this paper we investigate all categories of finite fields suitable for elliptic curve cryptography on the ATmega128 microcontroller: Fp, F2d , and Fpd . It turns out that binary fields enable the most efficient implementations.
منابع مشابه
Efficient Implementation of NIST-Compliant Elliptic Curve Cryptography for Sensor Nodes
In this paper, we present a highly-optimized implementation of standards-compliant Elliptic Curve Cryptography (ECC) for wireless sensor nodes and similar devices featuring an 8-bit AVR processor. The field arithmetic is written in Assembly language and optimized for the 192-bit NIST-specified prime p = 2 − 2 − 1, while the group arithmetic (i.e. point addition and doubling) is programmed in AN...
متن کاملEfficient Implementation of Elliptic Curve Cryptography for Wireless Sensor Networks
One of the huge problems for security in sensor networks is the lack of resources. Typical sensor nodes such as the quite popular MICA and MICA2 Motes from UC Berkeley [1] are based on a microcontroller architecture with only a few KBytes of memory and severe limited computing ability. Strong publickey cryptography is therefore commonly seen as infeasible on such devices. In contrast to this pr...
متن کاملFast Implementation of Elliptic Curve Arithmetic in GF(pn)
Elliptic curve cryptosystems have attracted much attention in recent years and one of major interests in ECC is to develop fast algorithms for elliptic curve arithmetic. In this paper we present various improvement techniques for eld arithmetic in GF(p n)(p a prime), in particular , fast eld multiplication and inversion algorithms, and provide our implementation results on Pentium II and Alpha ...
متن کاملCan we avoid tests for zero in fast elliptic-curve arithmetic?
This paper analyzes the exact extent to which 0 and ∞ cause trouble in Montgomery’s fast branchless formulas for x-coordinate scalar multiplication on elliptic curves of the form by = x + ax + x. The analysis shows that some multiplications and branches can be eliminated from elliptic-curve primality proofs and from elliptic-curve cryptography.
متن کاملA Small and Fast Software Implementation of Elliptic Curve Cryptosystems over GF (p) on a 16-Bit Microcomputer
Recently the study and implementation of elliptic curve cryptosystems (ECC) have developed rapidly and its achievements have become a center of attraction. ECC has the advantage of high-speed processing in software even on restricted environments such as smart cards. In this paper, we concentrate on complete software implementation of ECC over a prime field on a 16-bit microcomputer M16C (10MHz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2008 شماره
صفحات -
تاریخ انتشار 2008